e-Learn @ SASTRA Back

Introduction

Representation of graphs using matrices

Theorem on maximum number of edges

Isomorphism in graphs

Problems

Line graphs

Operations on graphs

Degree sequence

Walk, path and cycle

Characterizations of bipartite graphs

Trees

Properties of trees

Eccentricity and centre of graph

Colouring of graphs

Chromatic polynomial

Revision

Revision

Independent sets

Cut point and cut edge

Characterization of cut point

Revision

Problems

Eulerian graphs

Characterization of Eulerian graphs

Revision-colouring of graphs

Planar graphs

Planar graphs(contd)

Euler theorem on planar graphs

five colour theorem

five colour theorem

Fleury's algorithm

Connectivity

Subgraphs

Ramsey's numbers

Matching

Matching

Matching

Hall's theorem

Hamiltonian graphs

Block graphs

subgraphs

Problems

Problems

Problems

Problems

Problems

Revision

Revision

Revision

Revision